Numerical Irreducible Decomposition Using PHCpack
نویسندگان
چکیده
Homotopy continuation methods have proven to be reliable and efficient to approximate all isolated solutions of polynomial systems. In this paper we show how we can use this capability as a blackbox device to solve systems which have positive dimensional components of solutions. We indicate how the software package PHCpack can be used in conjunction with Maple and programs written in C. We describe a numerically stable algorithm for decomposing positive dimensional solution sets of polynomial systems into irreducible components. 2000 Mathematics Subject Classification. Primary 65H10; Secondary 13P05, 14Q99, 68N30, 68W30.
منابع مشابه
PHCpack in Macaulay
The Macaulay2 package PHCpack provides an interface to PHCpack, a generalpurpose polynomial system solver that uses homotopy continuation. The main method is a numerical blackbox solver which is implemented for all Laurent systems. The package also provides a fast mixed volume computation, the ability to filter solutions, homotopy path tracking, and a numerical irreducible decomposition method....
متن کاملPHCpack in Macaulay2
The Macaulay2 package PHCpack provides an interface to PHCpack, a generalpurpose polynomial system solver that uses homotopy continuation. The main method is a numerical blackbox solver which is implemented for all Laurent systems. The package also provides a fast mixed volume computation, the ability to filter solutions, homotopy path tracking, and a numerical irreducible decomposition method....
متن کاملParallel Homotopy Algorithms to Solve Polynomial Systems
Homotopy continuation methods to compute numerical approximations to all isolated solutions of a polynomial system are known as “embarrassingly parallel”, i.e.: because of their low communication overhead, these methods scale very well for a large number of processors. Because so many important problems remain unsolved mainly due to their intrinsic computational complexity, it would be embarras...
متن کاملNumerical Local Irreducible Decomposition
Globally, the solution set of a system of polynomial equations with complex coefficients can be decomposed into irreducible components. Using numerical algebraic geometry, each irreducible component is represented using a witness set thereby yielding a numerical irreducible decomposition of the solution set. Locally, the irreducible decomposition can be refined to produce a local irreducible de...
متن کاملInterfacing with the Numerical Homotopy Algorithms in PHCpack
Our Maple package PHCmaple came to existence in 2004 when it provided a convenient interface to the basic functionality of phc, a program which is a part of PHCpack and implements numeric algorithms for solving polynomial systems using polynomial homotopy continuation. Following the recent development of PHCpack the package has been extended with functions that deal with singular polynomial sys...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2003